Lax Logical Relations
نویسندگان
چکیده
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relations, they are preserved by the meanings of all lambda-calculus terms. We show that lax logical relations coincide with the correspondences of Schoett, the algebraic relations of Mitchell and the pre-logical relations of Honsell and Sannella on Henkin models, but also generalise naturally to models in cartesian closed categories and to richer languages.
منابع مشابه
A compositional generalisation of logical relations
Binary logical relations do not compose. So we generalise the notion of logical relation to one of lax logical relation, so that binary lax logical relations do compose. We give both a direct generalisation and a corresponding category theoretic formulation. We generalise the Basic Lemma for logical relations to a Basic Lemma for lax logical relations. Finally, we give an axiomatic category the...
متن کاملComplete Lax Logical Relations for Cryptographic Lambda-Calculi
Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equivalence in typed lambda calculi, see e.g. Sumii and Pierce’s logical relation for a cryptographic lambda-calculus. We clarify Sumii and Pierce’s approach, showing that the right tool is prelogical relations, or lax logical relatio...
متن کاملA cottage industry of lax extensions
In this work, we describe an adjunction between the comma category of Set-based monads under the V -powerset monad and the category of associative lax extensions of Set-based monads to the category of V -relations. In the process, we give a general construction of the Kleisli extension of a monad to the category of V-relations.
متن کاملA Note on the Topologicity of Quantale-Valued Topological Spaces
For a quantale V, the category V-Top of V-valued topological spaces may be introduced as a full subcategory of those V-valued closure spaces whose closure operation preserves finite joins. In generalization of Barr’s characterization of topological spaces as the lax algebras of a lax extension of the ultrafilter monad from maps to relations of sets, for V completely distributive, V-topological ...
متن کاملAxiomatics for Data Refinement in Call by Value Programming Languages
We give a systematic category theoretic axiomatics for modelling data re nement in call by value programming languages. Our leading examples of call by value languages are extensions of the computational -calculus, such as FPC and languages for modelling nondeterminism, and extensions of the rst order fragment of the computational -calculus, such as a CPS language. We give a category theoretic ...
متن کامل